Recursive properties of euclidean domains
نویسندگان
چکیده
منابع مشابه
Euclidean Functions of Computable Euclidean Domains
We study the complexity of (finitely-valued and transfinitely-valued) Euclidean functions for computable Euclidean domains. We examine both the complexity of the minimal Euclidean function and any Euclidean function. Additionally, we draw some conclusions about the proof-theoretical strength of minimal Euclidian functions in terms of Reverse Mathematics.
متن کاملRemarks about Euclidean Domains
We will call (1) the d-inequality. Sometimes it is expressed in a different way: for nonzero a and b, if a|b then d(a) ≤ d(b). This is equivalent to the d-inequality, taking into account of course the different roles of a and b in the two descriptions. Examples of Euclidean domains are Z (with d(n) = |n|), F [T ] for any field F (with d(f) = deg f ; this example is the reason that one doesn’t a...
متن کاملRecursive domains in proteins.
The domain is a fundamental unit of protein structure. Numerous studies have analyzed folding patterns in protein domains of known structure to gain insight into the underlying protein folding process. Are such patterns a haphazard assortment or are they similar to sentences in a language, which can be generated by an underlying grammar? Specifically, can a small number of intuitively sensible ...
متن کاملWeak Metrics on Euclidean Domains
A weak metric on a set is a function that satisfies the axioms of a metric except the symmetry and the separation axioms. The aim of this paper is to present some interesting weak metrics and to study some of their properties. In particular, we introduce a weak metric, called the Apollonian weak metric, on any subset of a Euclidean space which is either bounded or whose boundary is unbounded. W...
متن کاملHoles and Maps of Euclidean Domains
We study the behavior of the quasiconvexity and bounded turning of holes of domains under quasisymmetric and bilipschitz maps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1985
ISSN: 0168-0072
DOI: 10.1016/0168-0072(85)90035-1